A Mixed-Binary Convex Quadratic Reformulation for Box-Constrained Nonconvex Quadratic Integer Program

摘要

In this paper, we propose a mixed-binary convex quadratic programmingreformulation for the box-constrained nonconvex quadratic integer program andthen implement IBM ILOG CPLEX 12.6 to solve the new model. Computationalresults demonstrate that our approach clearly outperform the very recentstate-of-the-art solvers.